THE THEORY AND PRACTICE OF TRANSFORMING CALL-BY-NEED INTO CALL-BY-VALUEMYCROFT A.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 83; PP. 269-281; BIBL. 10 REF.Conference Paper

CONSTRUCTING CALL-BY-VALUE CONTINUATION SEMANTICSSETHI R; TANG A.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 71; PP. 556-570; BIBL. 12 REF.Conference Paper

CONSTRUCTING CALL-BY-VALUE CONTINUATION SEMANTICSSETHI R; TANG A.1980; J. ASS. COMPUTG MACHIN; USA; DA. 1980; VOL. 27; NO 3; PP. 580-597; BIBL. 16 REF.Article

THE SEMANTICS OF CALL-BY-VALUE AND CALL-BY-NAME IN A NONDETERMINISTIC ENVIRONMENTHENNESSY MCB.1980; S.I.A.M. J. COMPUTG; USA; DA. 1980; VOL. 9; NO 1; PP. 67-84; BIBL. 21 REF.Article

PARAMETER PASSING IN NONDETERMINISTIC RECURSIVE PROGRAMSBENSON DB.1979; J. COMPUTER SYST. SCI.; USA; DA. 1979; VOL. 19; NO 1; PP. 50-62; BIBL. 14 REF.Article

A PROPOS DE LA SEMANTIQUE DE L'APPEL PAR VALEUR SELON A. ARNOLDGUESSARIAN I.1978; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1978; VOL. 12; NO 4; PP. 287-289; BIBL. 2 REF.Serial Issue

THRESHOLD EVALUATION AND THE SEMANTICS OF CALL BY VALUE, ASSIGNMENT AND GENERIC PROCEDURES.LANG B.1977; IN: ACM SYMP. PRINC. PROGRAM. LANG. 4; LOS ANGELES; 1977; NEW YORK; ASSOC. COMPUT. MACH.; DA. 1977; PP. 227-237; BIBL. 30 REF.Conference Paper

Call-by-value is dual to call-by-name : ReloadedWADLER, Philip.Lecture notes in computer science. 2005, pp 185-203, issn 0302-9743, isbn 3-540-25596-6, 19 p.Conference Paper

Subtyping union typesVOUILLON, Jérome.Lecture notes in computer science. 2004, pp 415-429, issn 0302-9743, isbn 3-540-23024-6, 15 p.Conference Paper

An operational characterization of strong normalizationPAOLINI, Luca; PIMENTEL, Elaine; ROCCA, Simona Ronchi et al.Lecture notes in computer science. 2006, pp 367-381, issn 0302-9743, isbn 3-540-33045-3, 1Vol, 15 p.Conference Paper

Jumbo A-CalculusBLAIN LEVY, Paul.Lecture notes in computer science. 2006, pp 444-455, issn 0302-9743, isbn 3-540-35904-4, 12 p.Conference Paper

Managing the granularity of constraint-based analyses by rule transformationCHANG, Byeong-Mo.Information processing letters. 2002, Vol 83, Num 2, pp 79-88, issn 0020-0190Article

λμ-calculus and duality : Call-by-name and call-by-valueROCHETEAU, Jérome.Lecture notes in computer science. 2005, pp 204-218, issn 0302-9743, isbn 3-540-25596-6, 15 p.Conference Paper

Interprocedural herbrand equalitiesMÜLLER-OLM, Markus; SEIDL, Helmut; STEFFEN, Bernhard et al.Lecture notes in computer science. 2005, pp 31-45, issn 0302-9743, isbn 3-540-25435-8, 15 p.Conference Paper

Call-by-name and call-by-value as token-passing interaction netsSINOT, Francois-Régis.Lecture notes in computer science. 2005, pp 386-400, issn 0302-9743, isbn 3-540-25593-1, 15 p.Conference Paper

Elementary affine logic and the call-by-value lambda calculusCOPPOLA, Paolo; DAL LAGO, Ugo; DELLA ROCCA, Simona Ronchi et al.Lecture notes in computer science. 2005, pp 131-145, issn 0302-9743, isbn 3-540-25593-1, 15 p.Conference Paper

LJQ : A strongly focused calculus for intuitionistic logicDYCKHOFF, Roy; LENGRAND, Stéphane.Lecture notes in computer science. 2006, pp 173-185, issn 0302-9743, isbn 3-540-35466-2, 1Vol, 13 p.Conference Paper

Call-by-value separability and computabilityPAOLINI, Luca.Lecture notes in computer science. 2001, pp 74-89, issn 0302-9743, isbn 3-540-42672-8Conference Paper

Axioms for delimited continuations in the CPS hierarchyKAMEYAMA, Yukiyoshi.Lecture notes in computer science. 2004, pp 442-457, issn 0302-9743, isbn 3-540-23024-6, 16 p.Conference Paper

A bisimulation for dynamic sealingSUMII, Eijiro; PIERCE, Benjamin C.ACM SIGPLAN notices. 2004, Vol 39, Num 1, pp 161-172, issn 1523-2867, 12 p.Conference Paper

A proof theoretical account of continuation passing styleOGATA, Ichiro.Lecture notes in computer science. 2002, pp 490-505, issn 0302-9743, isbn 3-540-44240-5, 16 p.Conference Paper

Domain-free λμ-calculusFUJITA, Ken-Etsu.Theoretical informatics and applications. 2000, Vol 34, Num 6, pp 433-466Article

Call-by-value mixin modules reduction semantics, side effects, typesHIRSCHOWITZ, Tom; LEROY, Xavier; WELLS, J. B et al.Lecture notes in computer science. 2004, pp 64-78, issn 0302-9743, isbn 3-540-21313-9, 15 p.Conference Paper

Descriptive and Relative Completeness of Logics for Higher-Order FunctionsHONDA, Kohei; BERGER, Martin; YOSHIDA, Nobuko et al.Lecture notes in computer science. 2006, pp 360-371, issn 0302-9743, isbn 3-540-35904-4, 12 p.Conference Paper

Encoding strategies in the lambda calculus with interaction netsMACKIE, Ian.Lecture notes in computer science. 2006, pp 19-36, issn 0302-9743, isbn 3-540-69174-X, 1Vol, 18 p.Conference Paper